Home > Search Results: keywords:"integer linear programming (ILP)"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Project portfolio optimisation with time and resources
 Huml, Tomáš ; Barták, Roman (advisor) ; Vlach, Milan (referee)
Title: Project portfolio optimization with time and resources Author: Bc. Tomáš Huml Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Doc. RNDr. Roman Barták, Ph.D Abstract: Traditional project portfolio optimization deals with static projects that are not evolving in time. The focus of this diploma thesis is on projects that are spread in time, typically such projects consists of a sequence (or other partially ordered structure) of actions that require some resources (money, people, etc.) for realization. Then the project portfolio optimization deals with selecting a subset of projects according to given time and space (resource) restrictions and optimizing certain criteria such as overall profit. This problem is very close to oversubscribed scheduling where the most profitable subset of orders is being scheduled. Hence scheduling techniques will be the main inspiration for solving this new type of problems. Lots of modelling algorithms for optimal portfolio selection are proposed in this diploma thesis and several of them are implemented in a program which is part of this thesis as well. Keywords: portfolio optimization, integer linear programming (ILP), workflow optimization, project interdependencies
Detailed record
Project portfolio optimisation with time and resources
 Huml, Tomáš ; Barták, Roman (advisor) ; Vlach, Milan (referee)
Title: Project portfolio optimization with time and resources Author: Bc. Tomáš Huml Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Doc. RNDr. Roman Barták, Ph.D Abstract: Traditional project portfolio optimization deals with static projects that are not evolving in time. The focus of this diploma thesis is on projects that are spread in time, typically such projects consists of a sequence (or other partially ordered structure) of actions that require some resources (money, people, etc.) for realization. Then the project portfolio optimization deals with selecting a subset of projects according to given time and space (resource) restrictions and optimizing certain criteria such as overall profit. This problem is very close to oversubscribed scheduling where the most profitable subset of orders is being scheduled. Hence scheduling techniques will be the main inspiration for solving this new type of problems. Lots of modelling algorithms for optimal portfolio selection are proposed in this diploma thesis and several of them are implemented in a program which is part of this thesis as well. Keywords: portfolio optimization, integer linear programming (ILP), workflow optimization, project interdependencies
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English